DF-PN in Go: An Application to the One-Eye Problem
نویسندگان
چکیده
Search algorithms based on the notion of proof and disproof numbers have been shown to be effective in many games. In this paper, we modify the depth-first proof-number search algorithm df-pn, in order to apply it to the game of Go. We develop a solver for one-eye problems, a special case of enclosed tsume-Go [ life and death] problems. Our results show that this approach is very promising.
منابع مشابه
Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domains with repetitions. Df-pn(r) cures it by ignoring proof and disproof numbers that may lead to infinite loops. This paper points out that df-pn(r) has a serious issue of underestimating proof and disproof numbers, while...
متن کاملAbout the Completeness of Depth-First Proof-Number Search
Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its theoretical properties remain poorly understood. This paper resolves the question of completeness of df-pn: its ability to solve any finite boolean-valued game tree search problem in principle, given unlimited amounts of time an...
متن کاملApplication of Tabu Search to a Special Class of Multicommodity Distribution Systems
Multicommodity distribution problem is one of the most interesting and useful models in mathematical programming due to its major role in distribution networks. The purpose of this paper is to describe and solve a special class of multicommodity distribution problems in which shipment of a commodity from a plant to a customer would go through different distribution centers. The problem is t...
متن کاملApplication of Tabu Search to a Special Class of Multicommodity Distribution Systems
Multicommodity distribution problem is one of the most interesting and useful models in mathematical programming due to its major role in distribution networks. The purpose of this paper is to describe and solve a special class of multicommodity distribution problems in which shipment of a commodity from a plant to a customer would go through different distribution centers. The problem is t...
متن کاملComparison of Df-pn based Search Algorithms on Shogi Brinkmate Problems
The currently best method is the one by Nagai, using df-pn+ to solve brinkmate problems. We have proposed a new threat based and proof number based algorithm called df-pn driven λ-search. We have conducted some preliminary experiments, showing that df-pn driven λ-search seems to be better than Nagai’s method in solving Shogi brinkmate problems. Although more invesigation is requiered, df-pn λ-s...
متن کامل